Improved Error Bounds for the Distance Distribution of Reed-Solomon Codes
نویسندگان
چکیده
We use the generating function approach to derive simple expressions for factorial moments of distance distribution over Reed-Solomon codes. obtain better upper bounds error term a counting formula given by Li and Wan, which gives nontrivial estimates on number polynomials finite fields with prescribed leading coefficients linear factors. This improvement leads new results classification deep holes
منابع مشابه
Computing Error Distance of Reed-Solomon Codes
Under polynomial time reduction, the maximun likelihood decoding of a linear code is equivalent to computing the error distance of a received word. It is known that the decoding complexity of standard Reed-Solomon codes at certain radius is at least as hard as the discrete logarithm problem over certain large finite fields. This implies that computing the error distance is hard for standard Ree...
متن کاملImproved Decoding Algorithms for Reed-Solomon Codes
In coding theory, Reed-Solomon codes are one of the most well-known and widely used classes of error-correcting codes. In this thesis we study and compare two major strategies known for their decoding procedure, the Peterson-Gorenstein-Zierler (PGZ) and the Berlekamp-Massey (BM) decoder, in order to improve existing decoding algorithms and propose faster new ones. In particular we study a modif...
متن کاملOn the decoder error probability for Reed-Solomon codes
A characterization of the equivalence classes of prime-lengthcyclic codes over any finite field is given, generalizing the binary casesolved by Leon, Masely, and Pless. In the special case of cyclic (p, k)codes over GF(q), with p((q l), a one-to-one correspondence betweenthe equivelance classes and the orbits of k-sets under the affine group,GA(1, p) is established. In gener...
متن کاملBounds on the List-Decoding Radius of Reed--Solomon Codes
Techniques are presented for computing upper and lower bounds on the number of errors that can be corrected by list decoders for general block codes and speci cally for Reed Solomon RS codes The list decoder of Guruswami and Sudan implies such a lower bound referred to here as the GS bound for RS codes It is shown that this lower bound given by means of the code s length the minimum Hamming dis...
متن کاملDecoding of Reed Solomon Codes beyond the Error-Correction Bound
We present a randomized algorithm which takes as input n distinct points {(xi, yi)}i=1 from F × F (where F is a field) and integer parameters t and d and returns a list of all univariate polynomials f over F in the variable x of degree at most d which agree with the given set of points in at least t places (i.e., yi = f(xi) for at least t values of i), provided t = Ω( √ nd). The running time is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2023
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2023.3242612